Semantics and strong sequentiality of priority term rewriting systems
نویسندگان
چکیده
منابع مشابه
Semantics and Strong Sequentiality of Priority Term Rewriting Systems
This paper gives an operational semantics of priority term rewriting systems (PRS) by using conditional systems, whose reduction is decidable and stable under substitution. We also de ne the class of strong sequential PRSs and show that this class is decidable. Moreover, we show that the index rewriting of strong sequential PRSs gives a normalizing strategy.
متن کاملTerm Graph Rewriting and Strong Sequentiality
This paper propagates the use of term graph rewriting systems as a formal computational model. The deenition of both term graphs and the reduction relation on term graphs are more complex than their corresponding notions in term rewriting systems. Consequently, it is often believed that reasoning about term graph rewriting systems is inherently more diicult than reasoning about term rewriting s...
متن کاملA Refinement of Strong Sequentiality for Term Rewriting with Constructors
The notion of call-by-need evaluation has turned out to be very fruitful when applied to dialects of the i-calculus (Henderson and Morris, 1976, in “Proc. 3rd ACM Symp. on the Principles of Programming Languages, Atlanta; Kahn and Mac Queen, 1977, in “IFIP 77,” North-Holland, Amsterdam; Turner, 1979, Software Practice and Experience, Vol. 9; Vuillemin, 1974, J. Cornput. System3 .Sci. 9, 332-354...
متن کاملTransfinite Rewriting Semantics for Term Rewriting Systems
We provide some new results concerning the use of trans-nite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly innnite constructor terms by transsnite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transsnite rewrite sequences into shorter (possibly nite) ones. We also inv...
متن کاملStrong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used as an abstract model of some programming languages. While normalizing strategies are always desirable for achieving a good computational behavior of programs, when dealing with lazy languages infinitary normalizing strategies should be considered instead since (finite approximations of) infini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00080-2